Robust random early detection

Results: 66



#Item
11Analysis of Fair Queueing schedulers in Real Systems Luigi Rizzo Universita‘ di Pisa Paolo Valente Universita‘ di Modena e Reggio Emilia

Analysis of Fair Queueing schedulers in Real Systems Luigi Rizzo Universita‘ di Pisa Paolo Valente Universita‘ di Modena e Reggio Emilia

Add to Reading List

Source URL: info.iet.unipi.it

Language: English - Date: 2012-05-25 16:00:35
12This article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination. IEEE/ACM TRANSACTIONS ON NETWORKING 1  QFQ: Efficient Packet Scheduling

This article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination. IEEE/ACM TRANSACTIONS ON NETWORKING 1 QFQ: Efficient Packet Scheduling

Add to Reading List

Source URL: info.iet.unipi.it

Language: English - Date: 2012-10-17 17:46:17
13Differentiation Between Short and Long TCP Flows: Predictability of the Response Time Konstantin Avrachenkov† , Urtzi Ayesta†,∗ , Patrick Brown∗ , Eeva Nyberg‡ † INRIA  Sophia Antipolis, {k.avrachenkov, uayes

Differentiation Between Short and Long TCP Flows: Predictability of the Response Time Konstantin Avrachenkov† , Urtzi Ayesta†,∗ , Patrick Brown∗ , Eeva Nyberg‡ † INRIA Sophia Antipolis, {k.avrachenkov, uayes

Add to Reading List

Source URL: homepages.laas.fr

Language: English - Date: 2006-03-30 03:31:58
14ii  Contents List of Figures  iii

ii Contents List of Figures iii

Add to Reading List

Source URL: www.cypherpunks.ca

Language: English - Date: 2004-12-12 23:26:27
15MM2693_Internship_Advert copy

MM2693_Internship_Advert copy

Add to Reading List

Source URL: goodpricepharmacy.com.au

Language: English - Date: 2014-04-30 02:29:54
16Lower Bounds for Dynamic Partial Sums Mihai Pˇatra¸scu Let G be a group. The partial sums problem asks to maintain an array An] of group elements, initialized to zeroes (a.k.a. the identity), under the following

Lower Bounds for Dynamic Partial Sums Mihai Pˇatra¸scu Let G be a group. The partial sums problem asks to maintain an array An] of group elements, initialized to zeroes (a.k.a. the identity), under the following

Add to Reading List

Source URL: people.csail.mit.edu

Language: English - Date: 2009-11-10 15:02:16
17TCP-NCL: A Unified Solution for TCP Packet Reordering and Random Loss Chengdi Lai, Ka-Cheong Leung, and Victor O.K. Li Department of Electrical and Electronic Engineering The University of Hong Kong Pokfulam Road, Hong K

TCP-NCL: A Unified Solution for TCP Packet Reordering and Random Loss Chengdi Lai, Ka-Cheong Leung, and Victor O.K. Li Department of Electrical and Electronic Engineering The University of Hong Kong Pokfulam Road, Hong K

Add to Reading List

Source URL: www.eee.hku.hk

Language: English - Date: 2012-06-13 00:42:16
18  	
   NETWORK TECHNOLOGIES 	
  

    NETWORK TECHNOLOGIES  

Add to Reading List

Source URL: www.cablelabs.com

Language: English - Date: 2014-06-02 11:23:57
19Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson Lawrence Berkeley Laboratory University of California

Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson Lawrence Berkeley Laboratory University of California

Add to Reading List

Source URL: www.icir.org

Language: English - Date: 2000-01-26 17:12:32
20C:/Users/Gautam/Desktop/JournalRevision/Thatte_JRNL_twoColumn_revision.dvi

C:/Users/Gautam/Desktop/JournalRevision/Thatte_JRNL_twoColumn_revision.dvi

Add to Reading List

Source URL: www.isi.edu

Language: English - Date: 2013-05-17 18:59:37